A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satis ability ∗
نویسندگان
چکیده
Recently, Moser and Tardos [MT10] came up with a constructive proof of the Lovász Local Lemma. In this paper, we give another constructive proof of the lemma, based on Kolmogorov complexity. Actually, we even improve the Local Lemma slightly.
منابع مشابه
A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability
Recently, Moser and Tardos [MT10] came up with a constructive proof of the Lovász Local Lemma. In this paper, we give another constructive proof of the lemma, based on Kolmogorov complexity. Actually, we even improve the Local Lemma slightly.
متن کاملA Simple Algorithmic Proof of the Symmetric Lopsided Lovász Local Lemma
We provide a simple algorithmic proof for the symmetric Lopsided Lovász Local Lemma, a variant of the classic Lovász Local Lemma, where, roughly, only the degree of the negatively correlated undesirable events counts. Our analysis refers to the algorithm by Moser in 2009, however it is based on a simple application of the probabilistic method, rather than a counting argument, as are most of the...
متن کاملAn alternative proof for the constructive Asymmetric Lovász Local Lemma
We provide an alternative constructive proof of the Asymmetric Lovász Local Lemma. Our proof uses the classic algorithmic framework of Moser and the analysis introduced by Giotis, Kirousis, Psaromiligkos, and Thilikos in " On the algorithmic Lovász Local Lemma and acyclic edge coloring " , combined with the work of Bender and Richmond on the multivariable Lagrange Inversion formula.
متن کاملForbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences
Assume that for some α < 1 and for all nutural n a set Fn of at most 2 “forbidden” binary strings of length n is fixed. Then there exists an infinite binary sequence ω that does not have (long) forbidden substrings. We prove this combinatorial statement by translating it into a statement about Kolmogorov complexity and compare this proof with a combinatorial one based on Laslo Lovasz local lemm...
متن کاملKolmogorov Complexity, Lovász Local Lemma and Critical Exponents
D. Krieger and J. Shallit have proved that every real number greater than 1 is a critical exponent of some sequence [1]. We show how this result can be derived from some general statements about sequences whose subsequences have (almost) maximal Kolmogorov complexity. In this way one can also construct a sequence that has no “approximate” fractional powers with exponent that exceeds a given val...
متن کامل